Extended Modal Dependence Logic EMDL
نویسندگان
چکیده
In this paper we extend modal dependence logic MDL by allowing dependence atoms of the form dep(φ1, . . . , φn) where φi, 1 ≤ i ≤ n, are modal formulas (in MDL, only propositional variables are allowed in dependence atoms). The reasoning behind this extension is that it introduces a temporal component into modal dependence logic. E.g., it allows us to express that truth of propositions in some world of a Kripke structure depends only on a certain part of its past. We show that EMDL strictly extends MDL, i.e., there exist EMDL-formulas which are not expressible in MDL. However, from an algorithmic point of view we do not have to pay for this since we prove that the complexity of satisfiability and model checking of EMDL and MDL coincide. In addition we show that EMDL is equivalent toML extended by a certain propositional connective.
منابع مشابه
Axiomatizing Propositional Dependence Logics
We give sound and complete Hilbert-style axiomatizations for propositional dependence logic (PD), modal dependence logic (MDL), and extended modal dependence logic (EMDL) by extending existing axiomatizations for propositional logic and modal logic. In addition, we give novel labeled tableau calculi for PD, MDL, and EMDL. We prove soundness, completeness and termination for each of the labeled ...
متن کاملOn Extensions and Variants of Dependence Logic — A study of intuitionistic connectives in the team semantics setting
Dependence logic is a new logic which incorporates the notion of “dependence”, as well as “independence” between variables into first-order logic. In this thesis, we study extensions and variants of dependence logic on the first-order, propositional and modal level. In particular, the role of intuitionistic connectives in this setting is emphasized. We obtain, among others, the following result...
متن کاملThe Expressive Power of Modal Dependence Logic
We study the expressive power of various modal logics with team semantics. We show that exactly the properties of teams that are downward closed and closed under team k-bisimulation, for some finite k, are definable in modal logic extended with intuitionistic disjunction. Furthermore, we show that the expressive power of modal logic with intuitionistic disjunction and extended modal dependence ...
متن کاملModel Checking for Modal Dependence Logic: An Approach through Post's Lattice
In this paper we investigate an extended version of modal dependence logic by allowing arbitrary Boolean connectives. Modal dependence logic was recently introduced by Jouko Väänänen by extending modal logic by a the dependence atom dep(·). In this paper we study the computational complexity of the model checking problem. For a complete classification of arbitrary Boolean functions we are using...
متن کاملModal Independence Logic
This paper introduces modal independence logic MIL, a modal logic that can explicitly talk about independence among propositional variables. Formulas of MIL are not evaluated in worlds but in sets of worlds, so called teams. In this vein, MIL can be seen as a variant of Väänänen’s modal dependence logic MDL. We show that MIL embeds MDL and is strictly more expressive. However, on singleton team...
متن کامل